Eager Glr Parsing
نویسنده
چکیده
منابع مشابه
Chinese Syntactic Parsing Based on Extended GLR Parsing Algorithm with PCFG*
This paper presents an extended GLR parsing algorithm with grammar PCFG* that is based on Tomita’s GLR parsing algorithm and extends it further. We also define a new grammar—PCFG* that is based on PCFG and assigns not only probability but also frequency associated with each rule. So our syntactic parsing system is implemented based on rule-based approach and statistics approach. Furthermore our...
متن کاملFaster Generalized LR Parsing
Tomita devised a method of generalized LR (GLR) parsing to parse ambiguous grammars e ciently. A GLR parser uses linear-time LR parsing techniques as long as possible, falling back on more expensive general techniques when necessary. Much research has addressed speeding up LR parsers. However, we argue that this previous work is not transferable to GLR parsers. Instead, we speed up LR parsers b...
متن کاملGlr* : a Robust Parser for Spontaneously Spoken Language
This paper describes GLR*, a parsing system based on Tomita's Generalized LR parsing algorithm, that was designed to be robust to two particular types of extra-grammaticality: noise in the input, and limited grammar coverage. GLR* attempts to overcome these forms of extra-grammaticality by ignoring the unparsable words and fragments and conducting a search for the maximal subset of the original...
متن کاملPartitioning Grammars and composing Parsers
GLR parsers have been criticized by various authors for their potentially large sizes. Other parsers also have individual weaknesses and strengths. Our heterogeneous parsing algorithm is based on GLR parsers that handle the size and other problems by partitioning the grammarduring compilingand assembling the partitioned sub-grammars during parsing. We discuss diierent parsers for diierent gramm...
متن کاملA Fast General Parser for Automatic Code Generation
The code generator in a compiler attempts to match a subject tree against a collection of tree-shaped patterns for generating instructions. Tree-pattern matching may be considered as a generalization of string parsing. We propose a new generalized LR (GLR) parser, which extends the LR parser stack with a parser cactus. GLR explores all plausible parsing steps to find the least-cost matching. GL...
متن کامل